cT: An Imperative Language with Parallelizing Features Supporting the Computation Model "Autotransformation of the Evaluation Network"
نویسنده
چکیده
In this paper we present the programming language cT, intended for the development of portable software for multiprocessors in the environment supporting the computation model \autotransformation of evaluation network". The language was designed as an extension of C programming language with the new language primitives that represent the notions of the computation model. As a result, there was produced an imperative language with functional features.
منابع مشابه
Models of EFL Learners’ Vocabulary Development: Spreading Activation vs. Hierarchical Network Model
Semantic network approaches view organization or representation of internal lexicon in the form of either spreading or hierarchical system identified, respectively, as Spreading Activation Model (SAM) and Hi- erarchical Network Model (HNM). However, the validity of either model is amongst the intact issues in the literature which can be studied through basing the instruction compatible wi...
متن کاملExamining the Features of an English Language Test: Reliability-related Issues
Most universities across Iran tend to develop English tests for placement, exit, achievement, and other purposes. Examining the various features of such tests is imperative for making informed decisions about learners’ achievement level. The present study examined the features of a university-wide administered English language achievement test at Iran University of Science and Technology (IUST)...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملSemantic Foundations of Commutativity Analysis
This paper presents the semantic foundations of commutativity analysis, an analysis technique for automatically parallelizing programs written in a sequential, imperative programming language. Commutativity analysis views the computation as composed of operations on objects. It then analyzes the program at this granularity to discover when operations commute (i.e. generate the same result regar...
متن کاملAutomatically Parallelizing Serial Programs Using Commutativity Analysis
This paper introduces a new analysis technique, commutativity analysis, for automatically parallelizing programs written in a sequential, imperative programming language. Existing parallelizing compilers preserve the data dependences of the original serial program. They analyze the program at the level of individual reads and writes to single words of memory to generate parallel code that prese...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995